Convex invertible cones and Nevanlinna-Pick interpolation: The suboptimal case

نویسندگان

چکیده

Nevanlinna-Pick interpolation developed from a topic in classical complex analysis to useful tool for solving various problems control theory and electrical engineering. Over the years many extensions of original problem were considered, including different function spaces, nonstationary problems, several variable settings with matrix operator points. Here we discuss variation on positive real odd functions evaluated This was studied by Cohen Lewkowicz using convex invertible cones Lyapunov order, but never fully resolved. In this paper present solution special case that refer as ‘suboptimal’ based connections case. The requires representation linear maps going back R.D. Hill an when are completely positive, which reported earlier work will briefly review here.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Invertible Cones, Nevalinna-Pick Interpolation and the Set of Lyapunov Solutions

For a real matrix A whose spectrum avoids the imaginary axis, it is shown that the three following, seemingly independent problems, are in fact equivalent. • Characterizing the set of real symmetric solutions of the algebraic Lyapunov inclusion associated with A. • The image of all Nevalinna-Pick interpolations associated with the spectrum of A. • The structure of the Convex Invertible Cone gen...

متن کامل

Nevanlinna - Pick Interpolation For

We study the Nevanlinna-Pick problem for a class of subalgebras of H∞. This class includes algebras of analytic functions on embedded disks, the algebras of finite codimension in H∞ and the algebra of bounded analytic functions on a multiply connected domain. Our approach uses a distance formula that generalizes Sarason’s [18] work. We also investigate the difference between scalar-valued and m...

متن کامل

Parametric Nevanlinna-Pick Interpolation Theory

We consider the robust control problem for the system with real uncertainty. This type of problem can be represented with some parameters varying between the boundaries and is formulated as parametric Nevanlinna-Pick interpolation problem in this paper. The existence of a solution for such interpolation problem depends on the positivity of the corresponding Pick matrix with elements belonging t...

متن کامل

Spectral Factorization and Nevanlinna - Pick Interpolation *

We develop a spectral factorization algorithm based on linear fractional transformations and on the Nevanlinna-Pick interpolation theory. The algorithm is recursive and depends on a choice of points (Zk, k 1, 2, ") inside the unit disk. Under a mild condition on the distribution of the zk's, the convergence of the algorithm is established. The algorithm is flexible and convergence can be influe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2022

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2022.11.050